Methodbook: Recommending Move Method Refactorings via Relational Topic Models
نویسندگان
چکیده
منابع مشابه
Dynamic Relational Topic Models
This paper presents the Dynamic Relational Topic Model, a new dynamic topic model that incorporates both document text and relationships for discovering the underlying topics in document collections and their evolution over time. We derive an approximate variational inference algorithm for our model and demonstrate its effectiveness over previous approaches by analyzing papers in Computer Scien...
متن کاملMove-Instance-Method Refactorings: Experience, Issues, and Solutions
Refactorings, by definition, preserve the behavior of a target program. Such a strong property is encoded by precisely defined preconditions for each refactoring. Only if all preconditions are satisfied will a target program be transformed. Code transformation is done by following the rules defined to produce syntactically-correct, refactored code. Consequently, most behavior-changing violation...
متن کاملRecommending Related Articles in Wikipedia via a Topic-Based Model
Wikipedia is currently the largest encyclopedia publicly available on the Web. In addition to keyword search and subject browsing, users may quickly access articles by following hyperlinks embedded within each article. The main drawback of this method is that some links to related articles could be missing from the current article. Also, a related article could not be inserted as a hyperlink if...
متن کاملGeneralized Relational Topic Models with Data Augmentatio
Relational topic models have shown promise on analyzing document network structures and discovering latent topic representations. This paper presents three extensions: 1) unlike the common link likelihood with a diagonal weight matrix that allows the-same-topic interactions only, we generalize it to use a full weight matrix that captures all pairwise topic interactions and is applicable to asym...
متن کاملGeneralized Relational Topic Models with Data Augmentation
Relational topic models have shown promise on analyzing document network structures and discovering latent topic representations. This paper presents three extensions: 1) unlike the common link likelihood with a diagonal weight matrix that allows the-same-topic interactions only, we generalize it to use a full weight matrix that captures all pairwise topic interactions and is applicable to asym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2014
ISSN: 0098-5589,1939-3520
DOI: 10.1109/tse.2013.60